Full S matrix calculation via a single real-symmetric Lanczos recursion: the Lanczos artificial boundary inhomogeneity method.
نویسندگان
چکیده
We present an efficient and robust method for the calculation of all S matrix elements (elastic, inelastic, and reactive) over an arbitrary energy range from a single real-symmetric Lanczos recursion. Our new method transforms the fundamental equations associated with Light's artificial boundary inhomogeneity approach from the primary representation (original grid or basis representation of the Hamiltonian or its function) into a single tridiagonal Lanczos representation, thereby affording an iterative version of the original algorithm with greatly superior scaling properties. The method has important advantages over existing iterative quantum dynamical scattering methods: (a) the numerically intensive matrix propagation proceeds with real symmetric algebra, which is inherently more stable than its complex symmetric counterpart; (b) no complex absorbing potential or real damping operator is required, saving much of the exterior grid space which is commonly needed to support these operators and also removing the associated parameter dependence. Test calculations are presented for the collinear H+H(2) reaction, revealing excellent performance characteristics.
منابع مشابه
An effective method for eigen-problem solution of fluid-structure systems
Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...
متن کاملTurbo charging time-dependent density-functional theory with Lanczos chains.
We introduce a new implementation of time-dependent density-functional theory which allows the entire spectrum of a molecule or extended system to be computed with a numerical effort comparable to that of a single standard ground-state calculation. This method is particularly well suited for large systems and/or large basis sets, such as plane waves or real-space grids. By using a superoperator...
متن کاملA Gpu Implementation of the Filtered Lanczos
This paper describes a graphics processing unit (GPU) implementation of the Filtered Lanczos Procedure for the solution of large, sparse, symmetric eigenvalue problems. The Filtered Lanczos Procedure uses a carefully chosen polynomial spectral transformation to accelerate the convergence of the Lanczos method when computing eigenvalues within a desired interval. This method has proven particula...
متن کاملThe Design of a Block Rational Lanczos Code with Partial Reorthogonalization and Implicit Restarting
We discuss the design and development of a new Fortran code EA16 for the computation of selected eigenvalues and eigenvectors of large-scale real symmetric eigenvalue problems. EA16 can be used for either the standard or the generalized eigenvalue problem. The underlying method used by EA16 is the block Lanczos method with partial reorthogonalization plus implicit restarting, combined with purg...
متن کاملDELFT UNIVERSITY OF TECHNOLOGY REPORT 07-09 A Minimal Residual Method for Shifted Skew-Symmetric Systems
We describe the MRS solver, a Minimal Residual method based on the Lanczos algorithm that solves problems from the important class of linear systems with a shifted skew-symmetric coefficient matrix using short vector recurrences. The MRS solver is theoretically compared with other Krylov solvers and illustrated by some numerical experiments.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The Journal of chemical physics
دوره 120 3 شماره
صفحات -
تاریخ انتشار 2004